Stability and Sensitivity of Tridiagonal LU Factorization without Pivoting
نویسندگان
چکیده
منابع مشابه
Stability and sensitivity of tridiagonal LU factorization without pivoting
In this paper the accuracy of LU factorization of tridiagonal matrices without pivoting is considered. Two types of componentwise condition numbers for the L and U factors of tridiadonal matrices are presented and compared. One type is a condition number with respect to small relative perturbations of each entry of the matrix. The other type is a condition number with respect to small component...
متن کاملParallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملA Comparison of Pivoting Strategies for the Direct LU Factorization
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm fr...
متن کاملStability of block LU factorization
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...
متن کاملParallel Symbolic Factorization for Sparse LU with Static Pivoting
This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general sparse unsymmetric matrices. Our parallel algorithm uses a graph partitioning approach, applied to the graph of |A|+ |A| , to partition the matrix in such a way that is good for sparsity preservation as well as for parallel factorization. The partitioning yields a so-call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2004
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-004-6025-7